Resilient co-scheduling of malleable applications
نویسندگان
چکیده
منابع مشابه
Resilient co-scheduling of malleable applications
Recently, the benefits of co-scheduling several applications have been demonstrated in a fault-free context, both in terms of performance and energy savings. However, large-scale computer systems are confronted by frequent failures, and resilience techniques must be employed for large applications to execute efficiently. Indeed, failures may create severe imbalance between applications, and sig...
متن کاملLeakage-Resilient Non-malleable Codes
A recent trend in cryptography is to construct cryptosystems that are secure against physical attacks. Such attacks are usually divided into two classes: the leakage attacks in which the adversary obtains some information about the internal state of the machine, and the tampering attacks where the adversary can modify this state. One of the popular tools used to provide tamper-resistance are th...
متن کاملScheduling of MPI Applications: Self-co-scheduling
Scheduling parallel jobs has been an active investigation area. The scheduler has to deal with heterogeneous workloads and try to obtain throughputs and response times such that ensures good performance. We propose a Dynamic Space-Sharing Scheduling technique, the Self Co-Scheduling, based on the combination of the best benefits from Static Space Sharing and Co-Scheduling. A job is allocated a ...
متن کاملScheduling Malleable Task Trees
Solving sparse linear systems can lead to processing tree workflows on a platform of processors. In this study, we use the model of malleable tasks motivated in [1, 9] in order to study tree workflow schedules under two contradictory objectives: makespan minimization and memory minization. First, we give a simpler proof of the result of [8] which allows to compute a makespan-optimal schedule fo...
متن کاملMultiresource Malleable Task Scheduling
We present a technique for generalizing previously known results for single resource task systems to multiresource malleable task systems: Assuming a system with s resources, we apply a transformation which maps the system into a single resource task system. For a large class of heuristics it is shown, that given a heuristic H which achieves a suboptimality bound of c H with respect to the opti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The International Journal of High Performance Computing Applications
سال: 2017
ISSN: 1094-3420,1741-2846
DOI: 10.1177/1094342017704979